Generalized Hash Chain Traversal with Selective Output

Construction and Traversal of Hash Chain with Public Links

Current hash chain traversal techniques require that the intermediate links of the hash chain be stored secretly on a trusted storage. This requirement is undesirable in several applications. We propose a new construction of hash chains based on inserting a ‘breakpoint’ after fixed number of links in the chain. We also propose a method with which the current hash chain traversal techniques can ...

On The Computation-Storage Trade-Offs of Hash Chain Traversal

Almost Optimal Hash Sequence Traversal

We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log n), where n is the length of the chain. Our solution is based on the same principal amortization principle as [1], and has the same asymptotic behavior as this...

Fractal Hash Sequence Representation and Traversal

We introduce a novel amortization technique for computation of consecutive preimages of hash chains, given knowledge of the seed. While all previously known techniques have a memorytimes-computational complexity of O(n) per chain element, the complexity of our technique can be upper bounded at O(log n), making it a useful primitive for low-cost applications such as authentication, signatures an...

On Optimal Hash Tree Traversal for Interval Time-Stamping

Skewed trees constitute a two-parameter family of recursively constructed trees. Recently, Willemson proved that suitably picked skewed trees are space-optimal for interval time-stamping. At the same time, Willemson proposed a practical but suboptimal algorithm for nonrecursive traversal of skewed trees. We describe an alternative, extremely efficient traversal algorithm for skewed trees. The n...